optimal Detection of a Counterfeit Coin with Multi-arms Balances
نویسندگان
چکیده
We consider the problem of locating a light coin out of a set containing n coins, n ? 1 of which have the same weight. The weighing device is a balance with r 2 pans and, when r equally sized subset of coins are weighted, it indicates the eventual subset containing the light coin. We give an algorithm to nd the counterfeit coin that requires the minimum possible average number of weighings. All previous results on this problem considered two-arms balances only.
منابع مشابه
Optimal non-adaptive solutions for the counterfeit coin problem
We give optimal solutions to all versions of the popular counterfeit coin problem obtained by varying whether (i) we know if the counterfeit coin is heavier or lighter than the genuine ones, (ii) we know if the counterfeit coin exists, (iii) we have access to additional genuine coins, and (iv) we need to determine if the counterfeit coin is heavier or lighter than the genuine ones. Moreover, ou...
متن کاملThe general counterfeit coin problem
Given c nickels among which there may be a counterfeit coin, which can only be told apart by its weight being di erent from the others, and moreover b balances. What is the minimal number of weighings to decide whether there is a counterfeit nickel, if so which one it is and whether it is heavier or lighter than a genuine nickel. We give an answer to this question for sequential and nonsequenti...
متن کاملUsing the Optical Mouse Sensor as a Two-Euro Counterfeit Coin Detector
In this paper, the sensor of an optical mouse is presented as a counterfeit coin detector applied to the two-Euro case. The detection process is based on the short distance image acquisition capabilities of the optical mouse sensor where partial images of the coin under analysis are compared with some partial reference coin images for matching. Results show that, using only the vision sense, th...
متن کاملOptimal Algorithms for the Coin Weighing Problem with a Spring Scale
Suppose we are given n coins out of a collection of coins of two distinct weights w0 and w1, true and counterfeit coins, respectively, where d of them are counterfeit coins. Assume we are allowed to weigh subsets of coins in a spring scale. Determine the counterfeit coins in a minimal number of weighing. This problem is equivalent to the following learning problem: Given a linear function f = x...
متن کاملOn Anomaly Identification and the Counterfeit Coin Problem
We address a well-known problem in combinatorics involving the identification of counterfeit coins with a systematic approach. The methodology can be applied to cases where the total number of coins is exceedingly large such that brute force or enumerative comparisons become impractical. Based on the principle behind this approach, the minimum effort necessary for identification of the counterf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 61 شماره
صفحات -
تاریخ انتشار 1995